Preliminary Result of Parallel Double Divide and Conquer
نویسندگان
چکیده
This paper shows a concept for parallelization of double Divide and Conquer and its preliminary result. For singular value decomposition, double Divide and Conquer was recently proposed. It first computes singular values by a compact version of Divide and Conquer. The corresponding singular vectors are then computed by twisted factorization. The speed and accuracy of double Divide and Conquer are as well or even better than standard algorithms such as QR and Divide and Conquer. In addition, it is expected that double Divide and Conquer has great parallelism because each step is theoretically parallel and heavy communication is no required. However, any parallel model of double Divide and Conquer has not been studied yet. In this paper, policy of the parallelization is discussed. Then, a parallel implementation with MPI is tested on a distributed memory parallel computer. It successfully shows a high parallelism.
منابع مشابه
Introduction of Double Divide and Conquer and the Recent Progress
Abstract. An algorithm dubbed double Divide and Conquer is recently proposed, which first computes only singluar values by a part of Divide and Conquer and then computes the corresponding singular vectors by the twisted factorization. It accurately computes bidiagonal SVD in O(n) flops and is suited for parallelization when singular values are isolated. However, the twisted factorization can fa...
متن کاملFree Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods
This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...
متن کاملA Fast Parallel Squarer Based on Divide and Conquer
Fast and small squarers are needed in many applications such as image compression A new family of high performance parallel squarers based on the divide and conquer method is reported Our main result was realizing the basis cases of the divide and conquer recursion by using optimized n bit primitive squarers where n is in the range of to This method reduced the gate count and provided shorter c...
متن کاملOptimizing Skeletal Stream Processing for Divide and Conquer
Algorithmic skeletons intend to simplify parallel programming by providing recurring forms of program structure as predefined components. We present a new distributed task parallel skeleton for a very general class of divide and conquer algorithms for MIMD machines with distributed memory. Our approach combines skeletal internal task parallelism with stream parallelism. This approach is compare...
متن کاملDivide and Conquer: A New Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
Bondeli, S_, Divide and conquer: a parallel algorithm for the solution of a tridiagonal linear system of equations, Parallel Comput ing 17 (1991) 419-434_ We describe a divide and conquer algorithm which solves linear tridiagonal systems with one right-hand side, especially suited for parallel computers. The algorithm is flexible, permits multiprocessing or a combinat ion of vector and multipro...
متن کامل